Equivalence Transformations on Statecharts
نویسندگان
چکیده
Statecharts are a popular representation technique for conceptual models of the dynamics of a universe of discourse. However, designers are not supported in their work with dynamic models as well as they are for working with static models. We present a meta-model and a formalization of the semantics of a statechart language. Important results are the definition of the equivalence of statecharts and a sound and complete axiomatization of the equivalence. Based on this we define a set of basic schema transformations which do not change the semantics of a model. These transformations can be used to successively transform statecharts to achieve design goals or to prepare them for implementation.
منابع مشابه
On certain semigroups of transformations that preserve double direction equivalence
Let TX be the full transformation semigroups on the set X. For an equivalence E on X, let TE(X) = {α ∈ TX : ∀(x, y) ∈ E ⇔ (xα, yα) ∈ E}It is known that TE(X) is a subsemigroup of TX. In this paper, we discussthe Green's *-relations, certain *-ideal and certain Rees quotient semigroup for TE(X).
متن کاملSome Observations on Dirac Measure-Preserving Transformations and their Results
Dirac measure is an important measure in many related branches to mathematics. The current paper characterizes measure-preserving transformations between two Dirac measure spaces or a Dirac measure space and a probability measure space. Also, it studies isomorphic Dirac measure spaces, equivalence Dirac measure algebras, and conjugate of Dirac measure spaces. The equivalence classes of a Dirac ...
متن کاملStatecharts, Transition Structures and Transformations
Statecharts are state-transition machines endowed with hierarchy on states and parallelism on transitions. It is shown that a stat-echart is described by a pair of relations over transitions (a transition structure), the former describing causality and the other describing a notion of asymmetric independence. A statechart can be eeectively constructed from its transition structure. Transition s...
متن کاملEquivalences of Statecharts
We present a new semantics of Statecharts that excludes failures and a compositional formulation of this semantics based on Labelled Transition Systems (LTS). We consider a hierarchy of LTS equivalences and we study their congruence properties w.r. to statechart operators. 1 I n t r o d u c t i o n Statecharts are a specification language for reactive systems, introduced originally in [4]. The ...
متن کاملA Compositional Semantics for Statecharts using Labeled Transition Systems
We characterize the statecharts step semantics of Pnueli and Shalev as a mapping from an inductively deened algebra of statecharts terms to a domain of labeled transition systems (LTSs). Statecharts equivalence = sc , i.e. LTS iso-morphism, is shown not to be a congruence and hence the step semantics is not compositional. We deene a new semantic mapping > to a domain of LTSs with a richer label...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000